Particle Swarm Optimization In Solving Capacitated Vehicle Routing Problem
نویسندگان
چکیده
The Capacitated Vehicle Routing Problem (CVRP) is a NP – Complete problem and according to this definition there is no exact solution for it. So researchers try to achieve a near optimum solution for it, by using meta – heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle as a sequence of customers, that vehicle served. We employ Particle Swarm Optimization to solve this problem. In following of this paper we completely explain how we adjust PSO for a discrete space problem like CVRP, and the process of tweaking solutions, and at last for evaluation of our approach and show the effectiveness of our work, we show the result of running proposed approach over benchmarking data set of capacitated vehicle routing problem.
منابع مشابه
An Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملEvolutionary Algorithms for Vehicle Routing
This paper is a survey of the literature on applications of evolutionary algorithms for vehicle routing problems. It reports about genetic algorithms, evolution strategies and particle swarm optimization, when applied to the classical capacitated vehicle routing problem and many of its variants. The performance of evolutionary algorithms is also compared with the best alternative problem-solvin...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملCapacitated Vehicle Routing Problem Solving using Adaptive Sweep and Velocity Tentative PSO
Vehicle Routing Problem (VRP) has become an integral part in logistic operations which determines optimal routes for several vehicles to serve customers. The basic version of VRP is Capacitated VRP (CVRP) which considers equal capacities for all vehicles. The objective of CVRP is to minimize the total traveling distance of all vehicles to serve all the customers. Various methods are used to sol...
متن کامل